Surface Meshing Using Vertex Insertion
نویسنده
چکیده
This paper presents the requirements for a surface mesh to be valid. Aside from validity, it also discusses conditions for geometric similarity, which quantitatively describes how the surface mesh “matches” the model geometry. The surface mesh generation method presented here uses the parameter space of a model face to generate a coarse triangulation. In order to avoid the mapping problem, the coarse triangulation is refined in the real space to obtain proper mesh entity sizing. The Delaunay criterion is used to generate the coarse triangulation in the parameter space and a quasi-Delaunay criterion is used in the real space to complete the triangulation. The surface mesh is post-processed for self-intersection to guarantee its validity and for optimization. Problems coming from the possible periodicity and degeneracy of parameter spaces are addressed.
منابع مشابه
A Delaunay Meshing Algorithm with “Built-in” Concurrency
Most Delaunay refinement-based meshing algorithms maintain a vertex-free “buffer zone” enclosing the edges and faces in the mesh boundary to guarantee a lower bound on edge lengths. To maintain this buffer zone, vertex insertions on or near the domain boundary must be strictly ordered—it is this ordering requirement that makes parallelization difficult. In this paper, we show that it is possibl...
متن کاملNeighborhood-Based Element Sizing Control for Finite Element Surface Meshing
A method is presented for controlling element sizes on the interior of areas during surface meshing. A Delaunay background mesh is defined over which a neighborhood based interpolation scheme is used to interpolate element sizes. A brief description of natural neighbor interpolation is included and compared to linear interpolation. Two specific applications are presented that utilize the sizing...
متن کاملBoundary Refinement in Delaunay Mesh Generation Using Arbitrarily Ordered Vertex Insertion
In general, guaranteed-quality Delaunay meshing algorithms are difficult to parallelize because they require strictly ordered updates to the mesh boundary. We show that, by replacing the Delaunay cavity in the Bowyer-Watson algorithm with what we call the circumball intersection set, updates to the mesh can occur in any order, especially at the mesh boundary. To demonstrate this new idea, we de...
متن کاملMeshing Error of elliptic cylinder gear based on tooth contact analysis
In order to study the dynamic meshing characteristics of the elliptic cylinder gear and obtain the meshing error of the gear transmission system, the two-dimensional static contact analysis of the gear tooth surface is carried out by using ANSYS software, and the key parts of the contact area of the tooth surface are determined. Then, the dynamic meshing model of the elliptic cylinder gear is e...
متن کاملA Geometric Compression Algorithm for Massive Terrain Data Using Delaunay Triangulation
In this paper we introduce a new compression technique for a large triangulated terrains using Delaunay triangulation. Our compression technique decomposes a triangulated mesh into two parts. One is a point set whose connecting structure is deened implicitly by Delaunay edges. The other is the set of edges which cannot be recovered by the implicit Delaunay triangulation rule. Thus we only need ...
متن کامل